Well-Pointed Coalgebras (Extended Abstract)
نویسندگان
چکیده
For set functors preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper subobject and no proper quotient. And the initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Taylor [16]. Finally, the initial iterative algebra consists of all finite well-pointed coalgebras. Numerous examples are discussed e.g. automata, graphs, and labeled transition systems.
منابع مشابه
Well-Pointed Coalgebras
For set functors preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper subobject and no proper quotient. And the initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Osius [20] and Taylor [27]. Finally, ...
متن کاملAbstract Gsos Rules and a Compositional Treatment of Recursive Definitions
GSOS RULES AND A COMPOSITIONAL TREATMENT OF RECURSIVE DEFINITIONS STEFAN MILIUS, LAWRENCE S. MOSS, AND DANIEL SCHWENCKE Institut für Theoretische Informatik, Technische Universität Braunschweig, Germany e-mail address: [email protected] Department of Mathematics, Indiana University, Bloomington, IN, USA e-mail address: [email protected] Institut für Theoretische Informatik, Technische Univ...
متن کاملAbstract GSOS Rules and a Modular Treatment of Recursive Definitions
GSOS RULES AND A MODULAR TREATMENT OF RECURSIVE DEFINITIONS STEFAN MILIUS , LAWRENCE S. MOSS , AND DANIEL SCHWENCKE c a Lehrstuhl für Theoretische Informatik, Friedrich-Alexander Universität Erlangen-Nürnberg, Germany e-mail address: [email protected] b Department of Mathematics, Indiana University, Bloomington, IN, USA e-mail address: [email protected] c Institute of Transportation System...
متن کاملOn Refinement of Generic State-Based Software Components
This paper characterizes refinement of state-based software components modelled as pointed coalgebras for some Set endofunctors. The proposed characterization is parametric on a specification of the underlying behaviour model introduced as a strong monad. This provides a basis to reason about (and transform) state-based software designs. On Refinement of Generic State-based Software Components ...
متن کاملCoalgebras for Binary Methods: Properties of Bisimulations and Invariants
COALGEBRAS FOR BINARY METHODS: PROPERTIES OF BISIMULATIONS AND INVARIANTS HENDRIK TEWS 1 Abstract. Coalgebras for endofunctors C C can be used to model classes of object-oriented languages. However, binary methods do not fit directly into this approach. This paper proposes an extension of the coalgebraic framework, namely the use of extended polynomial functors Cop C C . This extension allows t...
متن کامل